Mixing Time Bounds for Overlapping Cycles Shuffles
نویسندگان
چکیده
منابع مشابه
Mixing time bounds for overlapping cycles shuffles
Consider a deck of n cards. Let p1, p2, . . . , pn be a probability vector and consider the mixing time of the card shuffle which at each step of time picks a position according to the pi’s and move the card in that position to the top. This setup was introduced in [5], where a few special cases were studied. In particular the case pn−k = pn = 1/2, k = Θ(n), turned out to be challenging and onl...
متن کاملRapid mixing of dealer shuffles and clumpy shuffles
A famous result of Bayer and Diaconis [2] is that the Gilbert-Shannon-Reeds (GSR) model for the riffle shuffle of n cards mixes in 3 2 log2 n steps and that for 52 cards about 7 shuffles suffices to mix the deck. In this paper, we study variants of the GSR shuffle that have been proposed to model more realistically how people actually shuffle a deck of cards. The clumpy riffle shuffle and deale...
متن کاملON THE RATE OF MIXING FOR p–SHUFFLES
The p-shuffle is a natural generalization of the dovetail shuffle. It is defined as follows. First, the deck is cut into a top stack and a bottom stack so that the distribution of the size of the top stack is Binomial (N, p), where N is the total number of cards in the deck. Then, conditional on the outcome of the cut, the two stacks are “riffled” in such a way that all possible riffles (interl...
متن کاملImproved Mixing Time Bounds for the Thorp Shuffle
E. Thorp introduced the following card shuffling model. Suppose the number of cards n is even. Cut the deck into two equal piles. Drop the first card from the left pile or from the right pile according to the outcome of a fair coin flip. Then drop from the other pile. Continue this way until both piles are empty. We show that if n is a power of 2 then the mixing time of the Thorp shuffle is O(l...
متن کاملMixing time bounds for oriented kinetically constrained spin models ∗
We analyze the mixing time of a class of oriented kinetically constrained spin models (KCMs) on a d-dimensional lattice of n sites. A typical example is the North-East model, a 0-1 spin system on the two-dimensional integer lattice that evolves according to the following rule: whenever a site’s southerly and westerly nearest neighbours have spin 0, with rate one it resets its own spin by tossin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2011
ISSN: 1083-6489
DOI: 10.1214/ejp.v16-912